Symmetry pattern transition in cellular automata with complex behavior
نویسندگان
چکیده
منابع مشابه
Symmetry pattern transition in cellular automata with complex behavior
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex symmetrical patterns by stochastically coupling a proportion p of pairs of sites located at equal distance from the center of the lattice. A nontrivial critical v...
متن کاملComplex Behavior in Long-Distance Cellular Automata
The purpose of this study was to systematically explore the behavior of one-dimensional long-distance cellular automata (LDCAs). Basic characteristics of LDCAs are explored, such as universal behavior, the prevalence of complexity with varying neighborhoods, and qualitative behavior as a function of configuration. It was found that rule 73 could potentially be Turing universal through the emula...
متن کاملCellular Automata with Regular Behavior
The study of cellular automata (CA) was mot ivated recent ly by their application to syst ems whose complex behavior arises from the int eraction among simple identical components . Actu ally, a CA consists of a linear biinfin ite array of cells, each one connected wit h the r cells that precede it on th e lefthand side and the r cells that follow it on th e right -hand side neighborho od . Eac...
متن کاملPattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach
FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...
متن کاملComplex Chaotic Behavior of a Class of Subshift Cellular Automata
A class of parameterized boolean, one-dimensional, biinfinite cellular autom at a has been st udied and t heir behavior observed when some param eters of the local funct ion are changed. T hese aut omata are equivalent to a par t icular class of boolean neural networks and t he change in t he parameters corresponds to a change in the symmetricity of t he connect ion matrix. T he purpo se is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos, Solitons & Fractals
سال: 2008
ISSN: 0960-0779
DOI: 10.1016/j.chaos.2006.09.052